The geometry of rank decompositions of matrix multiplication I: 2x2 matrices
نویسندگان
چکیده
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice subfamilies in the Strassen family of decompositions.
منابع مشابه
The geometry of rank decompositions of matrix multiplication II: 3×3 matrices
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice s...
متن کاملThe geometry of rank decompositions of matrix multiplication II: $3\times 3$ matrices
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and...
متن کاملOn higher rank numerical hulls of normal matrices
In this paper, some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated. A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given. Moreover, using the extreme points of the numerical range, the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$, where $A_1...
متن کاملStrassen's 2x2 matrix multiplication algorithm: A conceptual perspective
Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multiply two 2x2 matrices with only seven multiplications involve some more or less tedious calculations such as explicitly multiplying specific 2x2 matrices, expanding expressions to cancel terms with opposing signs, or expanding tensors over the standard basis. This is why the proof is nontrivial to m...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.08364 شماره
صفحات -
تاریخ انتشار 2016